1
00:00:00,720 --> 00:00:02,940
Hello and welcome back.

2
00:00:04,080 --> 00:00:14,970
In this video, we are going to try see for so let's run it first and see what he does.

3
00:00:18,310 --> 00:00:18,570
OK.

4
00:00:20,380 --> 00:00:23,230
Right, click here and open coming in.

5
00:00:25,610 --> 00:00:34,170
And this type CIFOR without any parameters, so we ask you to provide the secret password.

6
00:00:35,670 --> 00:00:37,590
So will provide us with

7
00:00:40,620 --> 00:00:51,540
trees and you says, come on now, you should expect better from us, so let's give it a longer password,

8
00:00:53,340 --> 00:00:57,100
maybe five years or more.

9
00:00:59,190 --> 00:01:00,390
Still not long enough.

10
00:01:01,980 --> 00:01:03,860
So an even longer possible.

11
00:01:06,750 --> 00:01:14,460
And now we know that it is quite a long password, more than five characters, but it's still around.

12
00:01:16,020 --> 00:01:20,940
So if you want to give this a try, please post a video first.

13
00:01:24,390 --> 00:01:32,970
All right, so this is how I resolve it, how you seem to impart this into Ghidorah.

14
00:01:34,940 --> 00:01:36,380
Sorry for.

15
00:01:41,680 --> 00:01:43,930
He's an Alpha 64 bit.

16
00:01:47,750 --> 00:01:48,250
OK.

17
00:01:51,730 --> 00:01:57,960
Draghi truly could rally to start the analysis process.

18
00:02:00,700 --> 00:02:01,840
Bitcoin, yes.

19
00:02:03,280 --> 00:02:05,200
And click on Analise.

20
00:02:09,180 --> 00:02:09,570
Watch.

21
00:02:09,670 --> 00:02:13,960
He's all right and he has finished analyzing.

22
00:02:14,940 --> 00:02:22,240
So let's go to the Functions folder and look for the main function and click on.

23
00:02:24,120 --> 00:02:30,290
This is the main function, but it's the wrong signature, so that is Aditi.

24
00:02:33,020 --> 00:02:47,220
Change the first parameter to Hoxsey in the second one to Char starts to harkavy.

25
00:02:50,150 --> 00:02:54,860
Now you will see it expects at least one parameter

26
00:02:57,470 --> 00:02:59,660
in exactly one parameter.

27
00:03:02,180 --> 00:03:13,670
So maybe supply no barometer, this test failed because oxes won and he showed it this message from

28
00:03:13,670 --> 00:03:22,290
here, and if it's applied to be sent by one parameter, then Occy, he exactly two.

29
00:03:22,940 --> 00:03:31,400
And so he went in here and it's said that the length of our part of it, I'm the one he's referring

30
00:03:31,400 --> 00:03:40,880
to this possibly a tie means as we are to e lengths and let's rename it.

31
00:03:48,190 --> 00:03:57,360
And then now see if the light is less than 10, then you show this bad message, which is this one,

32
00:03:57,490 --> 00:03:58,750
come on, so on.

33
00:03:59,920 --> 00:04:06,450
So this suggests that the length of the password is ten characters or more.

34
00:04:07,480 --> 00:04:10,570
So if you supply 10 characters now,

35
00:04:13,990 --> 00:04:23,410
one, two, three, four, five, six, seven, eight nine, 10 zero zero password because of this wrong

36
00:04:23,410 --> 00:04:23,900
password.

37
00:04:24,490 --> 00:04:34,690
So in here, he's going to do a while and he's going to use a variable.

38
00:04:38,020 --> 00:04:45,950
And this variable, look at him, he's set to zero before he enters the wire loop and this variable

39
00:04:46,300 --> 00:04:50,580
click on, he will highlight all the places it is being used.

40
00:04:51,520 --> 00:05:00,480
And if you look down here, we can see that this guy is incremented by one at the end of the loop and

41
00:05:00,490 --> 00:05:02,940
it goes back up here to check again.

42
00:05:03,370 --> 00:05:04,720
He was less than the length.

43
00:05:05,650 --> 00:05:07,000
Then he will continue to look.

44
00:05:08,890 --> 00:05:12,670
And inside the loop, first line, he is Tassie's.

45
00:05:13,210 --> 00:05:18,580
He checks about this every element.

46
00:05:21,040 --> 00:05:29,390
Plus two is not equal to this realignment you enter from the Pacific.

47
00:05:31,300 --> 00:05:38,290
So this suggests that local 18 isn't really next, so we can rename it.

48
00:05:42,340 --> 00:05:44,680
Array index,

49
00:05:50,140 --> 00:06:00,020
an array indexes is the way in which you assess each of the characters in the string.

50
00:06:00,550 --> 00:06:08,320
So, for example, here how that here is a string star in C programming.

51
00:06:09,020 --> 00:06:11,800
You can create a string like this.

52
00:06:20,330 --> 00:06:29,670
And then to assess each of the three elements you can do, for example, you can give a name.

53
00:06:33,200 --> 00:06:34,880
You can do things like this.

54
00:06:36,530 --> 00:06:41,630
String Zero is referring to character H.

55
00:06:43,610 --> 00:06:48,230
And then string one is referring to character, a song.

56
00:06:50,250 --> 00:06:52,230
You can also do things like this.

57
00:06:59,700 --> 00:07:09,300
String zero three zero is also referring to character age, and that is what you are seeing here three

58
00:07:09,360 --> 00:07:14,930
nights so early next, when you first enter, salute is zero.

59
00:07:15,570 --> 00:07:27,750
So because it is zero, it is comparing each with something before he does that plus two.

60
00:07:29,250 --> 00:07:36,810
So it is actually taking age and incrementing by two so each becomes G.

61
00:07:39,180 --> 00:07:41,360
Remember, he is asking

62
00:07:44,130 --> 00:07:48,210
if you go to ASCII tables and look at each.

63
00:07:54,990 --> 00:08:01,350
Is one year for if you're plus two can become six one zero six, which is due.

64
00:08:04,290 --> 00:08:16,710
So, Cindy, if you are comparing one, that means you are taking a impasto, as you can see, so it

65
00:08:16,710 --> 00:08:30,690
applies to his G, C, then C plus two is he came close to him A he do to see the plus.

66
00:08:30,690 --> 00:08:34,950
Do we have a do we see why.

67
00:08:34,960 --> 00:08:36,210
Plus do what is and why.

68
00:08:36,210 --> 00:08:48,270
Plus two, if you compare the back to why in the ASCII table and look for it as equal to one, two,

69
00:08:48,270 --> 00:08:58,590
one and then you plus two it becomes a one, two, three which is a left race is connected similarly.

70
00:08:59,850 --> 00:09:08,640
What his dash plus two dash plus to this dash plus two gives you forward slash.

71
00:09:11,860 --> 00:09:16,060
And finally, you press Tooheys, have you?

72
00:09:16,930 --> 00:09:26,540
So this algorithm algorithm is a method of solution to solve a problem.

73
00:09:27,670 --> 00:09:39,070
So this algorithm is actually taking every character of this tree and converting it, shifting it by

74
00:09:39,070 --> 00:09:50,920
two simple Hecate that you will actually become GCM, CFC, culebras, forest slash.

75
00:09:51,400 --> 00:09:52,730
So this is the password.

76
00:09:54,400 --> 00:10:00,520
So it is merely comparing every characteristic with your password that you enter.

77
00:10:01,450 --> 00:10:05,340
Now, more money finds any character which is wrong.

78
00:10:06,130 --> 00:10:10,850
It was your own password he will not see in the rest of the loop.

79
00:10:11,530 --> 00:10:14,260
So this is what this group is doing.

80
00:10:15,850 --> 00:10:20,200
This argument, one ugly one is your password.

81
00:10:20,470 --> 00:10:21,150
They enter.

82
00:10:22,450 --> 00:10:29,760
So the array next year is also assessing every character of the password you enter.

83
00:10:30,790 --> 00:10:32,140
So this is how it works.

84
00:10:32,640 --> 00:10:35,010
So that is try this and see this.

85
00:10:35,020 --> 00:10:35,500
Correct.

86
00:10:36,520 --> 00:10:43,750
So that is beneath typing your password, which.

87
00:10:45,780 --> 00:10:46,530
It's Masowe.

88
00:10:47,840 --> 00:10:50,600
GCM, KSE.

89
00:10:56,060 --> 00:10:59,840
To see he and she see.

90
00:11:03,050 --> 00:11:05,040
Left back forward.

91
00:11:05,600 --> 00:11:10,970
Let me carry you into the right basement.

92
00:11:12,050 --> 00:11:14,720
So this is how you solve this challenge.

93
00:11:15,650 --> 00:11:28,100
This challenge requires you to understand re indexing every indexing, how you assess each element of

94
00:11:28,100 --> 00:11:30,780
a string using his index.

95
00:11:31,460 --> 00:11:36,380
So once you understand this, you can understand this line of code.

96
00:11:37,340 --> 00:11:43,360
He also requires you to understand ASCII code, which we have covered the previous ACIN.

97
00:11:44,240 --> 00:11:45,710
So that's how you solve it.

98
00:11:46,760 --> 00:11:48,000
Thank you for watching.

99
00:11:48,350 --> 00:11:50,420
I'll see you in the next one.
